/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
int a[maxn];
int n;
int main()
{
    IOS;
    cin >> n;
    int ans = n + 1;
    for (int i = 1; i <= n; i++)
        cin >> a[i];

    int ap, ak;
    for (int p = 1; p <= n; p++)
    {
        if (p > ans)
            break;
        int i;
        for (i = n; i - p > 0; i--)
        {
            if (a[i] != a[i - p])
            {
                break;
            }
        }
        if (i < ans)
            ans = i, ap = p, ak = i - p;
    }
    cout << ak << ' ' << ap;
    getchar();
    getchar();
    return 0;
}
